614A - LinkCut Tree - CodeForces Solution

#include<bits/stdc++.h>
#define fastio {ios_base::sync_with_stdio(false);cin.tie(NULL);}
#define ll  long long int
#define all(u) sort(u.begin(),u.end())
#define rev(u) reverse(u.begin(),u.end())

using namespace std;
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//cout<<"Case "<<t<<": "<<ans<<endl;
//priority_queue <int, vector<int>, greater<int> > pq;
const int mod=1e9+7,M=1e5;
int t=0;

void T_11_11()
{

  ll a,b,k,f=0;
  cin>>a>>b>>k;

  for(ll i=0;i<=59;i++)
  {
      ll op=pow(k,i);
      if(op<a)
        continue;
      if(op>b)
        break;

      cout<<op<<" ";
  f=1;

  }
  if(f==0)
    cout<<"-1";
  cout<<endl;
}
int main()
{
    fastio;


    ll T;
//    cin>>T;
//    while(T--)
    T_11_11();


}